By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Volume 19, Issue 3, pp. 543-813

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Disks on a Tree: Analysis of a Combinatorial Game

Tomás Feder and Carlos Subi

pp. 543-552

Algorithms for Perfectly Contractile Graphs

Frédéric Maffray and Nicolas Trotignon

pp. 553-574

On the 3-Terminal Cut Polyhedron

Mohamed Didi Biha

pp. 575-587

A Brooks-Type Theorem for the Generalized List T-Coloring

Jirí Fiala, Daniel Král', and Riste Skrekovski

pp. 588-609

Multilevel Distance Labelings for Paths and Cycles

Daphne Der-Fen Liu and Xuding Zhu

pp. 610-621

Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case

Grzegorz Kubicki and Michal Morayne

pp. 622-632

Simplicial Complexes of Graphs and Hypergraphs with a Bounded Covering Number

Jakob Jonsson

pp. 633-650

Decycling Cartesian Products of Two Cycles

David A. Pike and Yubo Zou

pp. 651-663

Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms

Petteri Kaski

pp. 664-690

The Asymptotic Number of Binary Codes and Binary Matroids

Marcel Wild

pp. 691-699

Generalized Alon--Boppana Theorems and Error-Correcting Codes

Joel Friedman and Jean-Pierre Tillich

pp. 700-718

The Strong Chromatic Index of Random Graphs

Alan Frieze, Michael Krivelevich, and Benny Sudakov

pp. 719-727

Solvability of Graph Inequalities

Marcus Schaefer and Daniel Stefankovic

pp. 728-743

The PMU Placement Problem

Dennis J. Brueni and Lenwood S. Heath

pp. 744-761

On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique

Reuven Bar-Yehuda and Dror Rawitz

pp. 762-797

Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices

Dion Gijswijt

pp. 798-806

A Genus Bound for Digital Image Boundaries

Lowell Abrams and Donniell E. Fishkind

pp. 807-813